Inversion of Mosaic Hankel Matrices via Matrix Polynomial Systems

نویسندگان

  • George Labahn
  • Bernhard Beckermann
چکیده

Heinig and Tewodros [18] give a set of components whose existence provides a necessary and sufficient condition for a mosaic Hankel matrix to be nonsingular. When this is the case they also give a formula for the inverse in terms of these components. By converting these components into a matrix polynomial form we show that the invertibility conditions can be described in terms of matrix rational approximants for a matrix power series determined from the entries of the mosaic matrix. In special cases these matrix rational approximations are closely related to Padé and various well-known matrix-type Padé approximants. We also show that the inversion components can be described in terms of unimodular matrix polynomials. These are shown to be closely related to the V and W matrices of Antoulas used in his study of recursiveness in linear systems. Finally, we present a recursion which allows for the efficient computation of the inversion components of all nonsingular “principal mosaic Hankel” submatrices (including the components for the matrix itself).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inversion Components of Block Hankel-like Matrices

The inversion problem for square matrices having the structure of a block Hankel-like matrix is studied. Examples of such matrices in&de Hankel striped, Hankel layered, and vector Hankel matrices. It is shown that the components that both determine nonsingularity and construct the inverse of such matrices are closely related to certain matrix polynomials. These matrix polynomials are multidimen...

متن کامل

Generalized inversion of Toeplitz-plus-Hankel matrices

In many applications, e.g. digital signal processing, discrete inverse scattering, linear prediction etc., Toeplitz-plus-Hankel (T + H) matrices need to be inverted. (For further applications see [1] and references therein). Firstly the T +H matrix inversion problem has been solved in [2] where it was reduced to the inversion problem of the block Toeplitz matrix (the so-called mosaic matrix). T...

متن کامل

Fast Inversion of Hankel Systems and E cient BCH 1 Decoding

| BCH decoding usually involves the evaluation of the error-locator polynomial. This is often achieved with the Berlekamp-Massey algorithm. The evaluation of the error-locator polynomial may also be computed using fast inversion techniques for Hankel matrices. It can be shown that O(lt) steps are necessary, with l being the number of errors which occurred and t being the error-correction capabi...

متن کامل

Multidimensional structured matrices and polynomial systems

We apply and extend some well known and some recent techniques from algebraic residue theory in order to relate to each other two major subjects of algebraic and numerical computing that is computations with structured matrices and solving a system of polynomial equations In the rst part of our paper we extend the Toeplitz and Hankel structures of matrices and some of their known properties to ...

متن کامل

Levinson-type algorithms for polynomial fitting and for Cholesky and Q factors of Hankel and Vandermonde matrices

This paper presents Levinson-type algorithms for (i) polynomial fitting, (ii) obtaining a Q decomposition of Vandermonde matrices and a Cholesky factorization of Hankel matrices and (iii) obtaining the inverse of Hankel matrices. The algorithm for the least-squares solution of Hankel systems of equations, requires 3n + 9n+ 3 multiply and divide operation (MD0). The algorithm for obtaining an or...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004